0.04/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.04/0.13 % Command : run_E %s %d THM 0.13/0.34 % Computer : n018.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1440 0.13/0.34 % WCLimit : 180 0.13/0.34 % DateTime : Thu Jul 4 04:48:08 EDT 2024 0.13/0.34 % CPUTime : 0.21/0.49 Running higher-order theorem proving 0.21/0.50 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.xfRD5IRhL1/E---3.1_11970.p 0.21/0.52 # Version: 3.2.0-ho 0.21/0.52 # Preprocessing class: HSSSSMSSSSSNSSA. 0.21/0.52 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 0.21/0.52 # Starting post_as_ho12 with 180s (1) cores 0.21/0.52 # Starting new_bool_9 with 180s (1) cores 0.21/0.52 # Starting post_as_ho1 with 180s (1) cores 0.21/0.52 # Starting post_as_ho4 with 180s (1) cores 0.21/0.52 # Starting post_as_ho2 with 180s (1) cores 0.21/0.52 # Starting ehoh_best2_full_lfho with 180s (1) cores 0.21/0.52 # Starting full_lambda_10 with 180s (1) cores 0.21/0.52 # Starting new_ho_8 with 180s (1) cores 0.21/0.52 # post_as_ho1 with pid 12050 completed with status 0 0.21/0.52 # Result found by post_as_ho1 0.21/0.52 # Preprocessing class: HSSSSMSSSSSNSSA. 0.21/0.52 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 0.21/0.52 # Starting post_as_ho12 with 180s (1) cores 0.21/0.52 # Starting new_bool_9 with 180s (1) cores 0.21/0.52 # Starting post_as_ho1 with 180s (1) cores 0.21/0.52 # No SInE strategy applied 0.21/0.52 # Search class: HGHNF-FFSF21-SSSFFMBN 0.21/0.52 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.21/0.52 # Starting new_ho_10 with 98s (1) cores 0.21/0.52 # new_ho_10 with pid 12062 completed with status 0 0.21/0.52 # Result found by new_ho_10 0.21/0.52 # Preprocessing class: HSSSSMSSSSSNSSA. 0.21/0.52 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 0.21/0.52 # Starting post_as_ho12 with 180s (1) cores 0.21/0.52 # Starting new_bool_9 with 180s (1) cores 0.21/0.52 # Starting post_as_ho1 with 180s (1) cores 0.21/0.52 # No SInE strategy applied 0.21/0.52 # Search class: HGHNF-FFSF21-SSSFFMBN 0.21/0.52 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.21/0.52 # Starting new_ho_10 with 98s (1) cores 0.21/0.52 # Preprocessing time : 0.001 s 0.21/0.52 # Presaturation interreduction done 0.21/0.52 0.21/0.52 # Proof found! 0.21/0.52 # SZS status Theorem 0.21/0.52 # SZS output start CNFRefutation 0.21/0.52 thf(decl_sort1, type, a: $tType). 0.21/0.52 thf(decl_22, type, cK: (a > $o) > a > $o). 0.21/0.52 thf(decl_23, type, esk1_2: (a > $o) > (a > $o) > a). 0.21/0.52 thf(decl_24, type, esk2_0: a). 0.21/0.52 thf(decl_25, type, esk3_1: (a > $o) > a). 0.21/0.52 thf(decl_26, type, epred1_0: a > $o). 0.21/0.52 thf(decl_27, type, epred2_1: a > a > $o). 0.21/0.52 thf(decl_28, type, esk4_2: a > (a > $o) > a). 0.21/0.52 thf(cTHM116_1S, conjecture, (![X1:a]:(((cK @ (^[X2:a]:(?[X3:a > $o]:(((X3 @ X2)&![X4:a]:(((cK @ X3 @ X4)<=(X3 @ X4))))))) @ X1)=>?[X3:a > $o]:(((X3 @ X1)&![X2:a]:(((cK @ X3 @ X2)<=(X3 @ X2)))))))<=![X5:a > $o, X6:a > $o]:((![X1:a]:(((cK @ X5 @ X1)=>(cK @ X6 @ X1)))<=![X1:a]:(((X5 @ X1)=>(X6 @ X1)))))), file('/export/starexec/sandbox/tmp/tmp.xfRD5IRhL1/E---3.1_11970.p', cTHM116_1S)). 0.21/0.52 thf(c_0_1, negated_conjecture, ~((![X5:a > $o, X6:a > $o]:((![X1:a]:(((X5 @ X1)=>(X6 @ X1)))=>![X1:a]:(((cK @ X5 @ X1)=>(cK @ X6 @ X1)))))=>![X1:a]:(((cK @ (^[Z0/* 5 */:a]:(?[X3:a > $o]:((X3 @ Z0&![X4:a]:(((cK @ X3 @ X4)<=X3 @ X4)))))) @ X1)=>?[X3:a > $o]:(((X3 @ X1)&![X2:a]:(((X3 @ X2)=>(cK @ X3 @ X2))))))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM116_1S])])])). 0.21/0.52 thf(c_0_2, negated_conjecture, ![X14:a > $o, X15:a > $o, X17:a, X19:a > $o]:(((((X14 @ (esk1_2 @ X14 @ X15))|(~(cK @ X14 @ X17)|(cK @ X15 @ X17)))&(~(X15 @ (esk1_2 @ X14 @ X15))|(~(cK @ X14 @ X17)|(cK @ X15 @ X17))))&((cK @ (^[Z0/* 5 */:a]:(?[X3:a > $o]:((X3 @ Z0&![X4:a]:(((cK @ X3 @ X4)<=X3 @ X4)))))) @ esk2_0)&(((X19 @ (esk3_1 @ X19))|~(X19 @ esk2_0))&(~(cK @ X19 @ (esk3_1 @ X19))|~(X19 @ esk2_0)))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])). 0.21/0.52 thf(c_0_3, plain, ![X23:a]:(((epred1_0 @ X23)<=>?[X21:a > $o]:(((X21 @ X23)&![X22:a]:(((cK @ X21 @ X22)<=(X21 @ X22))))))), introduced(definition)). 0.21/0.52 thf(c_0_4, plain, ![X24:a, X26:a, X27:a, X28:a > $o]:(((((epred2_1 @ X24 @ X24)|~(epred1_0 @ X24))&(~(epred2_1 @ X24 @ X26)|(cK @ (epred2_1 @ X24) @ X26)|~(epred1_0 @ X24)))&(((X28 @ (esk4_2 @ X27 @ X28))|~(X28 @ X27)|(epred1_0 @ X27))&(~(cK @ X28 @ (esk4_2 @ X27 @ X28))|~(X28 @ X27)|(epred1_0 @ X27))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[])])])])])])])])). 0.21/0.52 thf(c_0_5, negated_conjecture, ![X5:a > $o, X3:a > $o, X1:a]:(((X3 @ (esk1_2 @ X3 @ X5))|(cK @ X5 @ X1)|~((cK @ X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.52 thf(c_0_6, negated_conjecture, ![X3:a > $o]:(((X3 @ (esk3_1 @ X3))|~((X3 @ esk2_0)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.52 thf(c_0_7, negated_conjecture, (((cK @ epred1_0 @ esk2_0))=(($true))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_3])). 0.21/0.52 thf(c_0_8, plain, ![X2:a, X1:a]:(((cK @ (epred2_1 @ X1) @ X2)|~((epred2_1 @ X1 @ X2))|~((epred1_0 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_4])). 0.21/0.52 thf(c_0_9, negated_conjecture, ![X3:a > $o]:((~((cK @ X3 @ (esk3_1 @ X3)))|~((X3 @ esk2_0)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.52 thf(c_0_10, negated_conjecture, ![X5:a > $o, X3:a > $o, X1:a]:(((cK @ X3 @ X1)|~((X3 @ (esk1_2 @ X5 @ X3)))|~((cK @ X5 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.52 thf(c_0_11, negated_conjecture, ![X3:a > $o, X5:a > $o]:(((cK @ X3 @ (esk3_1 @ (cK @ X5)))|(X5 @ (esk1_2 @ X5 @ X3))|~((cK @ X5 @ esk2_0)))), inference(spm,[status(thm)],[c_0_5, c_0_6])). 0.21/0.52 thf(c_0_12, negated_conjecture, (cK @ epred1_0 @ esk2_0), inference(cn,[status(thm)],[c_0_7])). 0.21/0.52 thf(c_0_13, plain, ![X3:a > $o, X1:a]:(((epred1_0 @ X1)|~((cK @ X3 @ (esk4_2 @ X1 @ X3)))|~((X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_4])). 0.21/0.52 thf(c_0_14, plain, ![X3:a > $o, X1:a]:(((X3 @ (esk4_2 @ X1 @ X3))|(epred1_0 @ X1)|~((X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_4])). 0.21/0.52 thf(c_0_15, plain, ![X3:a > $o, X2:a, X1:a]:(((epred2_1 @ X1 @ (esk1_2 @ (epred2_1 @ X1) @ X3))|(cK @ X3 @ X2)|~((epred2_1 @ X1 @ X2))|~((epred1_0 @ X1)))), inference(spm,[status(thm)],[c_0_5, c_0_8])). 0.21/0.52 thf(c_0_16, plain, ![X1:a]:(((epred2_1 @ X1 @ X1)|~((epred1_0 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_4])). 0.21/0.52 thf(c_0_17, negated_conjecture, ![X1:a]:((~((epred2_1 @ X1 @ esk2_0))|~((epred1_0 @ X1)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_8]), c_0_6])). 0.21/0.52 thf(c_0_18, negated_conjecture, ![X3:a > $o, X5:a > $o]:(((cK @ X3 @ (esk3_1 @ (cK @ X5)))|~((X3 @ (esk1_2 @ X5 @ X3)))|~((cK @ X5 @ esk2_0)))), inference(spm,[status(thm)],[c_0_10, c_0_6])). 0.21/0.52 thf(c_0_19, negated_conjecture, ![X3:a > $o]:(((cK @ X3 @ (esk3_1 @ (cK @ epred1_0)))|(epred1_0 @ (esk1_2 @ epred1_0 @ X3)))), inference(spm,[status(thm)],[c_0_11, c_0_12])). 0.21/0.52 thf(c_0_20, plain, ![X1:a, X3:a > $o, X2:a]:(((cK @ X3 @ X1)|~((X3 @ (esk1_2 @ (epred2_1 @ X2) @ X3)))|~((epred2_1 @ X2 @ X1))|~((epred1_0 @ X2)))), inference(spm,[status(thm)],[c_0_10, c_0_8])). 0.21/0.52 thf(c_0_21, plain, ![X1:a, X2:a]:(((epred1_0 @ X1)|~((epred2_1 @ X2 @ X1))|~((epred1_0 @ X2)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_8]), c_0_14])). 0.21/0.52 thf(c_0_22, plain, ![X3:a > $o, X1:a]:(((epred2_1 @ X1 @ (esk1_2 @ (epred2_1 @ X1) @ X3))|(cK @ X3 @ X1)|~((epred1_0 @ X1)))), inference(spm,[status(thm)],[c_0_15, c_0_16])). 0.21/0.52 thf(c_0_23, plain, ![X5:a > $o, X3:a > $o, X1:a]:(((cK @ X3 @ (esk4_2 @ X1 @ (cK @ X5)))|(X5 @ (esk1_2 @ X5 @ X3))|(epred1_0 @ X1)|~((cK @ X5 @ X1)))), inference(spm,[status(thm)],[c_0_5, c_0_14])). 0.21/0.52 thf(c_0_24, plain, ~((epred1_0 @ esk2_0)), inference(spm,[status(thm)],[c_0_17, c_0_16])). 0.21/0.52 thf(c_0_25, negated_conjecture, (cK @ epred1_0 @ (esk3_1 @ (cK @ epred1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_12])])). 0.21/0.52 thf(c_0_26, plain, ![X3:a > $o, X1:a]:(((cK @ X3 @ X1)|~((X3 @ (esk1_2 @ (epred2_1 @ X1) @ X3)))|~((epred1_0 @ X1)))), inference(spm,[status(thm)],[c_0_20, c_0_16])). 0.21/0.52 thf(c_0_27, plain, ![X3:a > $o, X1:a]:(((epred1_0 @ (esk1_2 @ (epred2_1 @ X1) @ X3))|(cK @ X3 @ X1)|~((epred1_0 @ X1)))), inference(spm,[status(thm)],[c_0_21, c_0_22])). 0.21/0.52 thf(c_0_28, negated_conjecture, ![X3:a > $o]:(((cK @ X3 @ (esk4_2 @ esk2_0 @ (cK @ epred1_0)))|(epred1_0 @ (esk1_2 @ epred1_0 @ X3)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_12]), c_0_24])). 0.21/0.52 thf(c_0_29, negated_conjecture, ![X3:a > $o]:(((cK @ X3 @ (esk3_1 @ (cK @ epred1_0)))|~((X3 @ (esk1_2 @ epred1_0 @ X3))))), inference(spm,[status(thm)],[c_0_10, c_0_25])). 0.21/0.52 thf(c_0_30, plain, ![X1:a]:(((cK @ epred1_0 @ X1)|~((epred1_0 @ X1)))), inference(spm,[status(thm)],[c_0_26, c_0_27])). 0.21/0.52 thf(c_0_31, plain, (epred1_0 @ (esk1_2 @ epred1_0 @ (cK @ epred1_0))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_28]), c_0_12])]), c_0_24])). 0.21/0.52 thf(c_0_32, negated_conjecture, (cK @ (cK @ epred1_0) @ (esk3_1 @ (cK @ epred1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30]), c_0_31])])). 0.21/0.52 thf(c_0_33, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_32]), c_0_12])]), ['proof']). 0.21/0.52 # SZS output end CNFRefutation 0.21/0.52 # Parsed axioms : 3 0.21/0.52 # Removed by relevancy pruning/SinE : 0 0.21/0.52 # Initial clauses : 11 0.21/0.52 # Removed in clause preprocessing : 2 0.21/0.52 # Initial clauses in saturation : 9 0.21/0.52 # Processed clauses : 58 0.21/0.52 # ...of these trivial : 1 0.21/0.52 # ...subsumed : 9 0.21/0.52 # ...remaining for further processing : 48 0.21/0.52 # Other redundant clauses eliminated : 0 0.21/0.52 # Clauses deleted for lack of memory : 0 0.21/0.52 # Backward-subsumed : 1 0.21/0.52 # Backward-rewritten : 0 0.21/0.52 # Generated clauses : 103 0.21/0.52 # ...of the previous two non-redundant : 92 0.21/0.52 # ...aggressively subsumed : 0 0.21/0.52 # Contextual simplify-reflections : 2 0.21/0.52 # Paramodulations : 103 0.21/0.52 # Factorizations : 0 0.21/0.52 # NegExts : 0 0.21/0.52 # Equation resolutions : 0 0.21/0.52 # Disequality decompositions : 0 0.21/0.52 # Total rewrite steps : 14 0.21/0.52 # ...of those cached : 11 0.21/0.52 # Propositional unsat checks : 0 0.21/0.52 # Propositional check models : 0 0.21/0.52 # Propositional check unsatisfiable : 0 0.21/0.52 # Propositional clauses : 0 0.21/0.52 # Propositional clauses after purity: 0 0.21/0.52 # Propositional unsat core size : 0 0.21/0.52 # Propositional preprocessing time : 0.000 0.21/0.52 # Propositional encoding time : 0.000 0.21/0.52 # Propositional solver time : 0.000 0.21/0.52 # Success case prop preproc time : 0.000 0.21/0.52 # Success case prop encoding time : 0.000 0.21/0.52 # Success case prop solver time : 0.000 0.21/0.52 # Current number of processed clauses : 38 0.21/0.52 # Positive orientable unit clauses : 5 0.21/0.52 # Positive unorientable unit clauses: 0 0.21/0.52 # Negative unit clauses : 1 0.21/0.52 # Non-unit-clauses : 32 0.21/0.52 # Current number of unprocessed clauses: 49 0.21/0.52 # ...number of literals in the above : 212 0.21/0.52 # Current number of archived formulas : 0 0.21/0.52 # Current number of archived clauses : 10 0.21/0.52 # Clause-clause subsumption calls (NU) : 246 0.21/0.52 # Rec. Clause-clause subsumption calls : 131 0.21/0.52 # Non-unit clause-clause subsumptions : 12 0.21/0.52 # Unit Clause-clause subsumption calls : 5 0.21/0.52 # Rewrite failures with RHS unbound : 0 0.21/0.52 # BW rewrite match attempts : 0 0.21/0.52 # BW rewrite match successes : 0 0.21/0.52 # Condensation attempts : 58 0.21/0.52 # Condensation successes : 0 0.21/0.52 # Termbank termtop insertions : 3548 0.21/0.52 # Search garbage collected termcells : 379 0.21/0.52 0.21/0.52 # ------------------------------------------------- 0.21/0.52 # User time : 0.010 s 0.21/0.52 # System time : 0.002 s 0.21/0.52 # Total time : 0.012 s 0.21/0.52 # Maximum resident set size: 1904 pages 0.21/0.52 0.21/0.52 # ------------------------------------------------- 0.21/0.52 # User time : 0.010 s 0.21/0.52 # System time : 0.006 s 0.21/0.52 # Total time : 0.016 s 0.21/0.52 # Maximum resident set size: 1716 pages 0.21/0.52 % E---3.1 exiting 0.21/0.53 % E exiting 0.21/0.53 EOF